Maximum flow problem - PDFSEARCH.IO - Document Search Engine

Maximum flow problem
Results: 146

#	Item
121	Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers∗ Jeff Erickson Amir Nayyeri Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:17:45 Induced path Shortest path problem Minimum spanning tree Maximum flow problem Cycle Degree Graph embedding Skew-symmetric graph Cycle rank Graph theory Mathematics Spanning tree
122	Homology Flows, Cohomology Cuts∗ Erin W. Chambers† Jeff Erickson‡ Amir Nayyeri§ Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 00:53:08 Planar graph Maximum flow problem Shortest path problem Minor Graph coloring Neighbourhood Homeomorphism Tree decomposition Connectivity Graph theory Mathematics Graph operations
123	Counting and Sampling Minimum Cuts in Genus g Graphs Erin W. Chambers∗ Kyle Fox† Amir Nayyeri‡ Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2013-09-03 13:18:47 Maximum flow problem Network flow Tree Matching Minimum spanning tree Minimum cut Graph Connectivity Directed acyclic graph Graph theory Mathematics Combinatorial optimization
124	CS 170 Fall 2006 — Discussion Handout #7 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 17:09:00 Network flow NP-complete problems Combinatorial optimization Maximum flow problem Flow network Vertex cover Matching Bipartite graph Connectivity Graph theory Mathematics Theoretical computer science
125	CS 170 Fall 2006 — Discussion Handout #8 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 16:42:32 Operations research Network theory NP-complete problems Convex optimization Linear programming Shortest path problem Maximum flow problem Simplex algorithm Vertex cover Graph theory Mathematics Theoretical computer science
126	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner Add to Reading List Source URL: math.mit.edu Language: English - Date: 2013-04-08 19:53:37 Operations research Combinatorial optimization Maximum flow problem Gradient descent Flow network Graph Max-flow min-cut theorem Lipschitz continuity Function Mathematics Numerical analysis Network flow
127	On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar Add to Reading List Source URL: www.ifp.illinois.edu Language: English - Date: 2005-06-29 17:06:05 Discrete mathematics Coding theory Information theory Wireless sensor network Finite fields Network coding Maximum flow problem Flow network Max-flow min-cut theorem Mathematics Network flow Graph theory
128	Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2013-01-06 00:21:58 Combinatorial optimization NP-complete problems Cut Maximum flow problem Graph embedding Matching Vertex cover Big O notation Graph coloring Mathematics Theoretical computer science Graph theory
129	IRE 1956 Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2005-04-25 15:54:19 Combinatorial optimization Combinatorics Maximum flow problem Max-flow min-cut theorem Flow network Cut Connectivity Minimum cut Topology Graph theory Mathematics Network flow
130	A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2005-01-20 14:41:23 Graph connectivity Maximum flow problem Network flow Cut Max-flow min-cut theorem Minimum cut Connectivity NP-complete problems K-edge-connected graph Graph theory Mathematics Combinatorial optimization

UPDATE